The extended linear complementarity problem and linear complementary-slackness systems
نویسنده
چکیده
The extended linear complementarity problem and linear complementary-slackness systems * B. De Schutter If you want to cite this report, please use the following reference instead: B. De Schutter, " The extended linear complementarity problem and linear complementary-slackness systems, "
منابع مشابه
The extended linear complementarity problem and the modeling and analysis of hybrid systems
First we give a short description of the Extended Linear Complementarity Problem (ELCP), which is a mathematical programming problem. We briefly discuss how this problem can be used in the analysis of discrete event systems and continuous variable systems. Next we show that the ELCP can also be used to model and to analyze hybrid systems. More specifically, we consider a traffic-light-controlle...
متن کاملThe Extended Linear Complementary Problem and the Modeling and Analysis of Hybrid Systems
First we give a short description of the Extended Linear Complementarity Problem (ELCP), which is a mathematical programming problem. We briefly discuss how this problem can be used in the analysis of discrete event systems and continuous variable systems. Next we show that the ELCP can also be used to model and to analyze hybrid systems. More specifically, we consider a traffic-light-controlle...
متن کاملThe Extended Linear Complementarity Problemand the Modeling and Analysis of HybridSystemsBart De Schutter ? and Bart De Moor ? ?
First we give a short description of the Extended Linear Complementarity Problem (ELCP), which is a mathematical programming problem. We brieey discuss how this problem can be used in the analysis of discrete event systems and continuous variable systems. Next we show that the ELCP can also be used to model and to analyze hybrid systems. More speciically, we consider a traac-light-controlled in...
متن کاملAn infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
An infeasible interior-point algorithm for solving the$P_*$-matrix linear complementarity problem based on a kernelfunction with trigonometric barrier term is analyzed. Each (main)iteration of the algorithm consists of a feasibility step andseveral centrality steps, whose feasibility step is induced by atrigonometric kernel function. The complexity result coincides withthe best result for infea...
متن کاملA full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
A full Nesterov-Todd (NT) step infeasible interior-point algorithm is proposed for solving monotone linear complementarity problems over symmetric cones by using Euclidean Jordan algebra. Two types of full NT-steps are used, feasibility steps and centering steps. The algorithm starts from strictly feasible iterates of a perturbed problem, and, using the central path and feasi...
متن کامل